Efficient packet transmission in wireless ad hoc networks with partially informed nodes

Efficient Transport in Wireless Ad-Hoc Networks

Clustering Wireless Ad Hoc Networks with Boundary Nodes

Based on the observation that most of the orphan clusters are generated from boundary nodes, we propose a Boundary-First Cluster-Minimized (BFCM) clustering algorithm to minimize the number of generated orphan cluster by boundary node. The proposed algorithm is compared to the well known IDbased and Degree-based algorithms. The simulation results show that with the same message and time complex...

Packet Drop Detection in Wireless Ad Hoc Networks

Link error and malicious nodes are responsible for packet drop in wireless ad hoc networks. When we observe a sequence of packet losses, may be due to link errors only, or by both link errors and malicious drop, we should determine the malicious node. In the insider-attack case, whereby malicious nodes that are part of the route exploit their knowledge of the interactions to drop a small amount...

Synchronization and Packet Separation in Wireless Ad-hoc Networks

Resisting Malicious Packet Dropping in Wireless Ad Hoc Networks

Most of the routing protocols in wireless ad hoc networks, such as DSR, assume nodes are trustworthy and cooperative. This assumption renders wireless ad hoc networks vulnerable to various types of Denial of Service (DoS) attacks. We present a distributed probing technique to detect and mitigate one type of DoS attacks, namely malicious packet dropping, in wireless ad hoc networks. A malicious ...